Home > Search Results: keywords:"abstract strategy game"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Arimaa challenge - comparission study of MCTS versus alpha-beta methods
 Jakl, Tomáš ; Majerech, Vladan (advisor) ; Hric, Jan (referee)
In the world of chess programming the most successful algorithm for game tree search is considered AlphaBeta search, however in game of Go it is Monte Carlo Tree Search. The game of Arimaa has similarities with both Go and Chess, but there has been no successful program using Monte Carlo Tree Search so far. The main goal of this thesis is to compare capabilities given by Monte Carlo Tree Search algorithm and AlphaBeta search, both having the same evaluation function, in the game of Arimaa.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English